The graph of monomial ideals

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Graph of Monomial Ideals

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring K[x1, . . . , xn]. The definition involves Gröbner bases or the action of the algebraic torus (K∗)n. We present algorithms for computing the (affine schemes representing) edges in this graph. We study the induced subgraphs on multigraded Hilbert schemes and on square-free monomial ideals. In the latter...

متن کامل

Monomial Ideals

Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic geometry.

متن کامل

Splittings of Monomial Ideals

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire’s splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bi...

متن کامل

Power of Monomial Ideals

1. Preliminaries 3 2. Gröbner Bases 3 2.1. Motivating Problems 3 2.2. Ordering of Monomials 3 2.3. The Division Algorithm in S = k[x1, . . . , xn] 5 2.4. Dickson’s Lemma 7 2.5. Gröbner Bases and the Hilbert Basis Theorem 10 2.6. Some Further Applications of Gröbner bases 18 3. Hilbert Functions 21 3.1. Macaulay’s Theorem 27 3.2. Hilbert Functions of Reduced Standard Graded k-algebras 37 3.3. Hi...

متن کامل

Liaison of Monomial Ideals

We give a simple algorithm to decide whether a monomial ideal of nite colength in a polynomial ring is licci, i.e., in the linkage class of a complete intersection. The algorithm proves that whether or not such an ideal is licci does not depend on whether we restrict the linkage by only allowing monomial regular sequences, or homogeneous regular sequences, or arbitrary regular sequences. We app...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2005

ISSN: 0022-4049

DOI: 10.1016/j.jpaa.2004.12.030